A Generalized Configuration Model With Triadic Closure

نویسندگان

چکیده

In this paper we present a generalized configuration model with random triadic closure (GCTC). This possesses five fundamental properties: large clustering coefficient, power law degree distribution, short path length, non-zero Pearson correlation, and existence of community structures. We analytically derive the correlation coefficient proposed model. select few datasets real-world networks. By simulation, show that GCTC matches very well in terms correlations coefficients. also test three well-known detection algorithms on our model, other prevalent benchmark models. performs equally as Finally, perform influence diffusion using independent cascade linear threshold spreads are much closer to those than suggests is suitable tool study network science problems where or plays an important role.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bistability through Triadic Closure

We propose and analyse a class of evolving network models suitable for describing a dynamic topological structure. Applications include telecommunication, on-line social behaviour and information processing in neuroscience. We model the evolving network as a discrete time Markov chain, and study a very general framework where, conditioned on the current state, edges appear or disappear independ...

متن کامل

A Will Triadic Closure Strengthen Ties in Social Networks?

The social triad—a group of three people—is one of the simplest and most fundamental social groups. Extensive network and social theories have been developed to understand its structure, such as triadic closure and social balance. Over the course of a triadic closure—the transition from two ties to three among three users, the strength dynamics of its social ties, however, are much less well un...

متن کامل

A coevolving model based on preferential triadic closure for social media networks

The dynamical origin of complex networks, i.e., the underlying principles governing network evolution, is a crucial issue in network study. In this paper, by carrying out analysis to the temporal data of Flickr and Epinions-two typical social media networks, we found that the dynamical pattern in neighborhood, especially the formation of triadic links, plays a dominant role in the evolution of ...

متن کامل

Homophily and Triadic Closure in Evolving Social Networks

We present a new network model accounting for homophily and triadic closure in the evolution of social networks. In particular, in our model, each node is characterized by a number of features and the probability of a link between two nodes depends on common features. The bipartite network of the actors and features evolves according to a dynamics that depends on three parameters that respectiv...

متن کامل

On the Relation of Strong Triadic Closure and Cluster Deletion

We study the parameterized and classical complexity of two related problems on undirected graphs G = (V,E). In Strong Triadic Closure we aim to label the edges in E as strong and weak such that at most k edges are weak and G contains no induced P3 with two strong edges. In Cluster Deletion, we aim to destroy all induced P3s by a minimum number of edge deletions. We first show that Strong Triadi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Network Science and Engineering

سال: 2023

ISSN: ['2334-329X', '2327-4697']

DOI: https://doi.org/10.1109/tnse.2022.3222528